Formal verification of a realistic compiler
نویسندگان
چکیده
منابع مشابه
Formal Compiler Verification with ACL2 BAKKALAUREATSARBEIT
This paper gives a short introduction to ACL2, a Lisp-like language used to make automatic proofs. ACL2 is used to prove the correctness of a compiler at source level. However it is shown that source level verification is not enough to be sure to have a correct compiler. Even if a compiler is correct at source level and passes the bootstrap test, it may be incorrect and produce wrong or even ha...
متن کاملLightweight Formal Methods for Compiler Verification
Compilers should not miscompile. Our work addresses problems in developing peephole optimizations that perform local rewriting to improve the efficiency of LLVM code. These optimizations are individually difficult to get right, particularly in the presence of undefined behavior; taken together they represent a persistent source of bugs. ”Provably Correct Peephole Optimizations with Alive” prese...
متن کاملApplying Formal Verification with Protocol Compiler
This paper presents a practical methodology for the application of formal verification to the industrial design environment “Protocol Compiler”. Our verification flow is to first create a testbench and simulate the design. Then we modify the testbench and perform a formal verification technique called assertion checking. The examples are taken from the networking arena. The first is a simplifie...
متن کاملDesign and formal verification of DZMBE+
In this paper, a new broadcast encryption scheme is presented based on threshold secret sharing and secure multiparty computation. This scheme is maintained to be dynamic in that a broadcaster can broadcast a message to any of the dynamic groups of users in the system and it is also fair in the sense that no cheater is able to gain an unfair advantage over other users. Another important feature...
متن کاملA Framework for Formal Verification of Compiler Optimizations
In this article, we describe a framework for formally verifying the correctness of compiler optimizations. We begin by giving formal semantics to a variation of the TRANS language [6], which is designed to express optimizations as transformations on control-flow graphs using temporal logic side conditions. We then formalize the idea of correctness of a TRANS optimization, and prove general lemm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications of the ACM
سال: 2009
ISSN: 0001-0782,1557-7317
DOI: 10.1145/1538788.1538814